100 research outputs found
Computing Topology Preservation of RBF Transformations for Landmark-Based Image Registration
In image registration, a proper transformation should be topology preserving.
Especially for landmark-based image registration, if the displacement of one
landmark is larger enough than those of neighbourhood landmarks, topology
violation will be occurred. This paper aim to analyse the topology preservation
of some Radial Basis Functions (RBFs) which are used to model deformations in
image registration. Mat\'{e}rn functions are quite common in the statistic
literature (see, e.g. \cite{Matern86,Stein99}). In this paper, we use them to
solve the landmark-based image registration problem. We present the topology
preservation properties of RBFs in one landmark and four landmarks model
respectively. Numerical results of three kinds of Mat\'{e}rn transformations
are compared with results of Gaussian, Wendland's, and Wu's functions
Sufficient conditions for topological invariance of 2D images under rigid transformations
International audienceIn â^2, rigid transformations are topology-preserving operations. However, this property is generally no longer true when considering digital images instead of continuous ones, due to digitization effects. In this article, we investigate this issue by studying discrete rigid transformations (DRTs) on â€^2. More precisely, we define conditions under which digital images preserve their topological properties under any arbitrary DRTs. Based on the recently introduced notion of DRT graph and the classical notion of simple point, we first identify a family of local patterns that authorize topological invariance under DRTs. These patterns are then involved in a local analysis process that guarantees topological invariance of whole digital images in linear time
Variational Registration of Multiple Images with the SVD based SqN Distance Measure
Image registration, especially the quantification of image similarity, is an
important task in image processing. Various approaches for the comparison of
two images are discussed in the literature. However, although most of these
approaches perform very well in a two image scenario, an extension to a
multiple images scenario deserves attention. In this article, we discuss and
compare registration methods for multiple images. Our key assumption is, that
information about the singular values of a feature matrix of images can be used
for alignment. We introduce, discuss and relate three recent approaches from
the literature: the Schatten q-norm based SqN distance measure, a rank based
approach, and a feature volume based approach. We also present results for
typical applications such as dynamic image sequences or stacks of histological
sections. Our results indicate that the SqN approach is in fact a suitable
distance measure for image registration. Moreover, our examples also indicate
that the results obtained by SqN are superior to those obtained by its
competitors.Comment: 12 pages, 5 figures, accepted at the conference "Scale Space and
Variational Methods" in Hofgeismar, Germany 201
Generalised median of a set of correspondences based on the hamming distance.
A correspondence is a set of mappings that establishes a relation between the elements of two data structures (i.e. sets of points, strings, trees or graphs). If we consider several correspondences between the same two structures, one option to define a representative of them is through the generalised median correspondence. In general, the computation of the generalised median is an NP-complete task. In this paper, we present two methods to calculate the generalised median correspondence of multiple correspondences. The first one obtains the optimal solution in cubic time, but it is restricted to the Hamming distance. The second one obtains a sub-optimal solution through an iterative approach, but does not have any restrictions with respect to the used distance. We compare both proposals in terms of the distance to the true generalised median and runtime
Visualization and Analysis of 3D Microscopic Images
In a wide range of biological studies, it is highly desirable to visualize and analyze three-dimensional (3D) microscopic images. In this primer, we first introduce several major methods for visualizing typical 3D images and related multi-scale, multi-time-point, multi-color data sets. Then, we discuss three key categories of image analysis tasks, namely segmentation, registration, and annotation. We demonstrate how to pipeline these visualization and analysis modules using examples of profiling the single-cell gene-expression of C. elegans and constructing a map of stereotyped neurite tracts in a fruit fly brain
Digital hyperplane fitting
International audienceThis paper addresses the hyperplane fitting problem of discrete points in any dimension (i.e. in Z d). For that purpose, we consider a digital model of hyperplane, namely digital hyperplane, and present a combinatorial approach to find the optimal solution of the fitting problem. This method consists in computing all possible digital hyperplanes from a set S of n points, then an exhaustive search enables us to find the optimal hyperplane that best fits S. The method has, however, a high complexity of O(n d), and thus can not be applied for big datasets. To overcome this limitation, we propose another method relying on the Delaunay triangulation of S. By not generating and verifying all possible digital hyperplanes but only those from the elements of the triangula-tion, this leads to a lower complexity of O(n d 2 +1). Experiments in 2D, 3D and 4D are shown to illustrate the efficiency of the proposed method
Modelling the generalised median correspondence through an edit distance.
On the one hand, classification applications modelled by structural pattern recognition, in which elements are represented as strings, trees or graphs, have been used for the last thirty years. In these models, structural distances are modelled as the correspondence (also called matching or labelling) between all the local elements (for instance nodes or edges) that generates the minimum sum of local distances. On the other hand, the generalised median is a well-known concept used to obtain a reliable prototype of data such as strings, graphs and data clusters. Recently, the structural distance and the generalised median has been put together to define a generalise median of matchings to solve some classification and learning applications. In this paper, we present an improvement in which the Correspondence edit distance is used instead of the classical Hamming distance. Experimental validation shows that the new approach obtains better results in reasonable runtime compared to other median calculation strategies
Wavelets for Texture Description in Nephele System
Abstract. In our paper we introduce comprehensive solution for processing and archiving information about artwork specimens used in the course of art restoration â Nephele. The information processing based on image data is used in the procedure of identification of pigment and binder present in the artwork, which is very important issue for restorers. Proposed approach geometrically aligns images of microscopic cross-sections of artwork color layers â image registration,and then creates preliminary color layer segmentation. The archiving part of the Nephele enables creating database entries for painting materials research database, their storage, and creating text-based queries. In addition to these traditional database functions, advanced report retrieval is supported; based on the similarity of image data, comparing either the ultraviolet and visual spectra images, and the electron microscopy images. The wavelet decomposition of the latter images provides basis for material characterization using features computed from the decomposed data
- âŠ